An Analytical and Experimental Study of Super-Seeding in BitTorrent-Like P2P Networks
نویسندگان
چکیده
With the popularity of BitTorrent-like P2P applications, improving its performance has been an active research area. Super-seeding, a special upload policy for the initial seeder, improves the efficiency in producing multiple seeds and reduces the uploading bytes of content initiators, thus being highly expected as a promising solution for improving downloading performance while decreasing uploading cost. However, the overall impacts of super seeding upon BitTorrent performance remain a question and have not been analyzed so far in literature. In this paper, we present an analytical and experimental study over the performance of super-seeding scheme. We attempt to answer the following questions: whether and how much super-seeding saves uploading cost, whether the overall downloading time is decreased by super-seeding, and in which circumstances superseeding performs worse. Based on the seeding process, our analytical study gives formulas on the new piece distribution time, average downloading time and minimum distribution time for heterogeneous P2P file distribution system with super-seeding. Robust evidence supporting the use (or not) of super-seeding is given based on our worldwide Internet experiments over wide distribution of 250 PlanetLab nodes. With a well-designed experimental scenario, we study the overall download time and upload cost of super seeding scheme under varying seed bandwidth and peer behavior. Results show that super-seeding can save an upload ratio of 20% and does help speeding up swarms in certain modes. Tentative conclusions about the effectiveness of super-seeding and its optimal working circumstances are given with inside mechanism analyzed and negative factor identified. Our work not only provides reference for the potential adoption of superseeding in BitTorrent and other P2P applications, but also much insights for the tussle of enhancing of Quality of Experience (QoE) and saving cost for a large-scale BitTorrent-like P2P commercial application. key words: super-seeding, quality of experience, performance evaluation
منابع مشابه
Search Request Routing in Bittorrent and other P2P based File Sharing Networks
Existing p2p file sharing networks doesn’t always give their users abilities to make an effective and fast searches for particular data. In this paper we introduce some improvements for main subset of these networks, especially for bittorrent and descript some well known methods of search query routing, used in other networks that may be useful for our purposes too. We describe some ideas of mo...
متن کاملImproving QoS in BitTorrent like p2p-based Video-on-Demand Systems
Among all peer-to-peer (P2P) filesharing systems, BitTorrent rises as the most prominent one. A recent analysis [1] shows that although P2P traffic is slightly declining, but BitTorrent traffic is still on the rise. It is responsible for more than 45-78% of all P2P traffic, roughly a quarter of all Internet traffic. This success has drawn a great deal of research interest on the system. In part...
متن کاملPerformance Modeling of BitTorrent Peer-to-Peer File Sharing Networks
BitTorrent is undoubtedly the most popular P2P file sharing application on today’s Internet. The widespread popularity of BitTorrent has attracted a great deal of attention from networking researchers who conducted various performance studies on it. This paper presents a comprehensive survey of analytical performance modeling techniques for BitTorrent networks. The performance models examined i...
متن کاملAttacks on BitTorrent - An Experimental Study
Peer-to-peer (P2P) networks and applications represent an efficient method of distributing various network contents across the Internet. Foremost among these networks is the BitTorrent protocol. While BitTorrent has become one of the most popular P2P applications, attacking BitTorrent applications recently began to arise. Although sources of the attacks may be different, their main goal is to s...
متن کاملA Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory
The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 91-B شماره
صفحات -
تاریخ انتشار 2008